Characterizations of one-way general quantum finite automata
نویسندگان
چکیده
منابع مشابه
Characterizations of one-way general quantum finite automata
Generally, unitary transformations limit the computational power of quantum finite automata (QFA). In this paper we study a generalized model named one-way general quantum finite automata (1gQFA), in which each symbol in the input alphabet induces a trace-preserving quantum operation, instead of a unitary transformation. Two different kinds of 1gQFA will be studied: measure-once one-way general...
متن کاملCharacterizations of 1-Way Quantum Finite Automata
The 2-way quantum finite automaton introduced by Kondacs and Watrous[KW97] can accept non-regular languages with bounded error in polynomial time. If we restrict the head of the automaton to moving classically and to moving only in one direction, the acceptance power of this 1-way quantum finite automaton is reduced to a proper subset of the regular languages. In this paper we study two differe...
متن کاملOne-Way Finite Automata with Quantum and Classical States
We introduce 2-way finite automata with quantum and classical states (2qcfa’s). This is a variant on the 2-way quantum finite automata (2qfa) model which may be simpler to implement than unrestricted 2qfa’s; the internal state of a 2qcfa may include a quantum part that may be in a (mixed) quantum state, but the tape head position is required to be classical. We show two languages for which 2qcf...
متن کاملDetermining the equivalence for one-way quantum finite automata
Two quantum finite automata are equivalent if for any input string x the two automata accept x with equal probability. In this paper, we focus on determining the equivalence for 1-way quantum finite automata with control language (CL-1QFAs) defined by Bertoni et al and measure-many 1-way quantum finite automata (MM-1QFAs) introduced by Kondacs and Watrous. It is worth pointing out that although...
متن کاملOne-Way Reversible and Quantum Finite Automata with Advice
• This Talk is about • The roles of advice that is given to one-way finite automata. • In particular, for reversible automata and quantum automata. • What is New? • A new characterization of reversible automata using advice. • A new necessary condition for quantum automata with advice. • New separations among advised language families • Why is This Result New? • This extends the existing framew...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.10.021